Computing Prüfer codes efficiently in parallel
نویسندگان
چکیده
منابع مشابه
Prüfer codes for acyclic hypertrees
We describe a new Prüfer code based on star-reductions which works for infinite acyclic hypertrees.
متن کاملColored Prüfer Codes for k-Edge Colored Trees
A combinatorial bijection between k-edge colored trees and colored Prüfer codes for labelled trees is established. This bijection gives a simple combinatorial proof for the number k(n − 2)!(nk−n n−2 ) of k-edge colored trees with n vertices.
متن کاملEfficiently repairing algebraic geometry codes
Minimum storage regenerating codes have minimum storage of data in each node and therefore are maximal distance separable (MDS for short) codes. Thus, the number of nodes is upper bounded by 2, where b is the bits of data stored in each node. From both theoretical and practical points of view (see the details in Section 1), it is natural to consider regenerating codes that nearly have minimum s...
متن کاملComputing Congruences Efficiently
For a fixed similarity type which is at least binary, we show there is a linear time algorithm for computing the principal congruence generated by a pair of elements. Let A be a finite algebra and let θ be a partition of A. In this note we give a simple algorithm for computing the smallest congruence containing θ and discuss its efficiency. We begin with the case that θ only contains one nontri...
متن کاملComputing Iceberg Queries Efficiently
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg queries, because the number of abovethreshold results is often very small (the tip of an iceberg), relative to the large amount of input data (the iceberg). Such iceberg queries are common in many applications, including dat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2000
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00221-8